The Derived Model Theorem
نویسنده
چکیده
We shall exposit here one of the basic theorems leading from large cardinals to determinacy, a result of Woodin known as the derived model theorem. The theorem dates from the mid80’s and has been exposited in several sets of informally circulated lecture notes (e.g., [12], [14]), but we know of no exposition in print. We shall also include a number of subsidiary and related results due to various people. We shall use very heavily the technique of stationary tower forcing. The reader should see Woodin’s paper [15] or Larson’s [3] for the basic facts about stationary tower forcing. The second main technical tool needed for a full proof of the derived model theorem is the theory of iteration trees. This is one of the main ingredients in the proof of Theorem 2.1 below, but since we shall simply take that theorem as a “black box” here, it is possible to read this paper without knowing what an iteration tree is. The paper is organized as follows. In §1, we introduce homogeneity, weak homogeneity, and universal Baireness. The main result here is the Martin-Solovay theorem, according to which all weakly homogeneous sets are universally Baire. We give a reasonably complete proof of this theorem. In §2 and §3, we show that in the presence of Woodin cardinals, homogeneity, weak homogeneity, and universal Baireness are equivalent. We also give, in §3, an argument of Woodin’s which shows that strong cardinals yield universally Baire representations after a collapse. In §4 we prove the tree production lemma, according to which sets admitting definitions with certain absoluteness properties are universally Baire. §5 contains a generic absoluteness theorem for (Σ1) Hom∞ statements. In §6 we state and prove the derived model theorem. In §7 we prove that in derived models, the pointclass Σ1 has the Scale Property, and in §8, we use this to produce derived models which satisfy ADR. This paper was written in Fall 2002, and circulated informally. In 2004, Larson’s monograph [3] on stationary tower forcing appeared. Much of the material in §2, §3, and §4 can be found in section 3.3 of [3]. Sections 3.2 and 3.4 of [3] use this machinery to prove important results of Woodin concerning generic absoluteness. In another direction, Neeman’s recent
منابع مشابه
A Non-radial rough DEA model
For efficiency evaluation of some of the Decision Making Units that have uncertain information, Rough Data Envelopment Analysis technique is used, which is derived from rough set theorem and Data Envelopment Analysis (DEA). In some situations rough data alter nonradially. To this end, this paper proposes additive rough–DEA model and illustrates the proposed model by a numerical example.
متن کاملبررسی فرایند نورد متقارن ورق های سه لایه با استفاده از تابع جریان و تئوری حد بالا
In this paper, a mathematical model for symmetrical multi-layer sheet rolling, in which the layers are unbounded before rolling, by using the upper bound method and stream function theorem is proposed. Using this model, we can investigate the plastic deformation behavior of sheets at the roll gap during rolling. Effect of various rolling conditions such as initial and final thickness and flow s...
متن کاملDesigning Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...
متن کاملA common fixed point theorem on ordered metric spaces
A common fixed point result for weakly increasing mappings satisfying generalized contractive type of Zhang in ordered metric spaces are derived.
متن کاملOn the norm of the derived subgroups of all subgroups of a finite group
In this paper, we give a complete proof of Theorem 4.1(ii) and a new elementary proof of Theorem 4.1(i) in [Li and Shen, On the intersection of the normalizers of the derived subgroups of all subgroups of a finite group, J. Algebra, 323 (2010) 1349--1357]. In addition, we also give a generalization of Baer's Theorem.
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008